
@Article{byung,
author = {K. Byung-in and K. Seongbae and S. Surya },
title = {Waste collection vehicle routing 
Problem with Time Windows},
journal = {Computers and Operations Research},
year = {2006},
OPTvolume = {33},
OPTpages = {3624–3642},
OPTmonth = {December}
}

@Article{hoong,
author = { C. L. Hoong and S. Melvyn AND M.T. KWONG },
title = {Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles},
journal = {European Journal of Operational Research},
year = {2003},
OPTvolume = {148},
OPTpages = {559-569},

}
@Article{kalczynski,
author = {P. Kalczynski},
title = { A Java Implementation of the Branch and Bound Algorithm: The 
Asymetric Traveling Salesman Problem},
journal = { Journal of Object Technology},
year = {2005},
OPTvolume = {2},
OPTnumber = {1},
OPTpages = {155-163}
}

@Article{land,
author = {A. H. Land and A. G. Doig},
title = {An automatic method of solving discrete programming 
problems},
journal = {Econometrica},
year = {1960},
OPTvolume = {28},
OPTnumber = {3},
OPTpages = {497-520}

}
@Article{solomon,
author = {M. Solomon },
title = {Algorithms for the Vehicle Routing and Scheduling Problems with 
Time Window Constraints},
journal = {Operations Research},
year = {1987},
OPTvolume = {35},
OPTpages = {254-265}
}

@Article{chang,
author = { Y Chang and L Chen},
title = {Solve the Vehicle Routing PROBLEM With Time Windows via a Genetic Algorithm},
journal = {Discrete And Continuous Dynamical Systems},
year = {2007}
}

@Article{prins,
author = {C Prins},
title = {A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem},
journal = {Computers and Operations Research},
year = {2004},,
OPTvolume = {31},
OPTnumber = {12},
OPTpages = {1985-2002}
}

@electronic{dalgety,
  author        = "J. Dalgety",
  title         = "The Icosian Game.",
  url       	= "http://www.puzzlemuseum.com/month/picm02/200207icosian.htm",
  year          = "2009"
};

@electronic{garn,
  author        = "W. Garn",
  title         = "Vehicle Routing Problem Algorithm",
  url       	= "http://osiris.tuwien.ac.at/~wgarn/VehicleRouting/vehicle_routing.html",
  year          = "2007"
};

@electronic{busby,
  author        = "B. Busby and et al,",
  title         = "Backtracking and Branch and Bound Algorithm",
  url       	= "http://www.academic.marist.edu/~jzbv/algorithms/StudentProjects/BacktrackingandBandB.ppt",
  year          = "2009"
};




@Incollection{balas,
  author        = "E. Balas and P. Toth",
  title         = "Branch and Bound Methods",
  booktitle     = "The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization",
  publisher     = "Wiley",
  address       = "New York",
  year          = "1985",
  pages         = "361-401"
};

@InProceedings{machado,
  author =       "P. Machado and J. Tavares  and Pereira F.  and Costa E.",
  title =        "Vehicle Routing Problem: Doing It The Evolutionary
                 Way",
  booktitle =    "GECCO 2002: Proceedings of the Genetic and Evolutionary
                 Computation Conference",
  editor =       "W. B. Langdon and E. Cant{\'u}-Paz and K. Mathias and
                 R. Roy and D. Davis and R. Poli and K. Balakrishnan and
                 V. Honavar and G. Rudolph and J. Wegener and L. Bull
                 and M. A. Potter and A. C. Schultz and J. F. Miller and
                 E. Burke and N. Jonoska",
  year =         "2002",
  pages =        "690",
  url =         {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2002/GA081.pdf},
  url = {ftp://cs.ucl.ac.uk/genetic/papers/gecco2002/gecco-2002-13.pdf},
  address = 	 "New York",
  publisher_address = "San Francisco, CA 94104, USA",
  month	 = 	 "9-13 July",
  publisher =    "Morgan Kaufmann Publishers",
  keywords = 	 "genetic algorithms, poster paper, co-evolution, combinatorial optimization, vehicle routing problem",

  notes	 = 	 "GECCO-2002. 
		  A joint meeting of the eleventh International Conference on
		  Genetic Algorithms (ICGA-2002) and the seventh Annual Genetic
		  Programming Conference (GP-2002)"
}




@InProceedings{tshoeke,
author = {S. Tschoeke and R. Lueling and B. Monien.},
title = {Solving the Traveling Salesman 
Problem with a Distributed Branch-and-Bound Algorithm on a 1024 Processor 
Network},
booktitle = {Parallel Processing Symposium},
OPTpages = {182-189},
OPTyear = {1995},
OPTnumber = {9},
OPTmonth = {April}}


@InProceedings{karova,
author = {M. Karova and V. Smarkov and S. Penev},
title = {Genetic operators crossover and mutation in solving the TSP problem},
booktitle = {International Conference on Computer Systems and Technologies - CompSysTech’ 2005},
OPTpages = {2-7},
OPTyear = {2005},
OPTpublisher = {Citeseer}}

@TechReport{nilsson,
author = {C. Nilsson},
title = {Heuristics for the Traveling Salesman Problem. A Report for 
Theoretical Computer Science.},
institution = {Linkoping University},
year = {2003}
}
